An Integer Programming Model for a Complex University Timetabling Problem: A Case Study
نویسندگان
چکیده
منابع مشابه
Binary integer programming model for university courses timetabling: a case study
It is proposed a binary integer programming model to handle a real instance of the courses-to-professors timetabling problem. The optimization criterion is the preferences of professors by courses and schedules. Besides the common set of constraints, specific features of this situation are considered. To decide about different optimal solutions, it is introduced a coefficient to measure (altern...
متن کاملAn Integer Programming Model for the School Timetabling Problem
This work presents a binary integer programming model applied to the process of fixing a sequence of meetings between teachers and students in a prefixed period of time, satisfying a set of constraints of various types, known as school timetabling problem. Pairs of teachers and classes associated to timeslots are modeled as binary integer variables weighted by parameters referring to teachers p...
متن کاملAn integer programming formulation for a case study in university timetabling
A novel 0–1 integer programming formulation of the university timetabling problem is presented. The model provides constraints for a great number of operational rules and requirements found in most academic institutions. Treated as an optimization problem, the objective is to minimize a linear cost function. With this objective, it is possible to consider the satisfaction of expressed preferenc...
متن کاملA new binary model for university examination timetabling: a case study
Examination timetabling problem (ETP) is one of the most important issues in universities. An improper timetable may result in students' dissatisfaction as it may not let them study enough between two sequential exams. In addition, the many exams to be scheduled, the large number of students who have taken different courses, the limited number of rooms, and some constraints su...
متن کاملAn Imperialist Competitive Algorithm and a Mixed Integer Programming Formulation for the Capacitated Vehicle Routing Problem
The Vehicle Routing Problem (VRP), a famous problem of operation research, holds a central place in combinatorial optimization problems. In this problem, a fleet vehicles with Q capacity start to move from depot and return after servicing to customers in which visit only ones each customer and load more than its capacity not at all. The objective is to minimize the number of used vehicles and t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Industrial Engineering and Management Systems
سال: 2017
ISSN: 1598-7248
DOI: 10.7232/iems.2017.16.1.141